The Cliiord Paterson Lecture, 1995 Modelling Communication Networks, Present and Future
نویسنده
چکیده
Modern communication networks are able to respond to randomly uctuating demands and failures by allowing buuers to ll, by rerouting traac and by real-locating resources. They are able to do this so well that, in many respects, large-scale networks appear as coherent, almost intelligent, organisms. The design and control of such networks present challenges of a mathematical, engineering and economic nature. In this lecture I describe some of the models that have proved useful in the analysis of stability, statistical sharing and pricing, in systems ranging from the telephone networks of today to the information superhighways of tomorrow. Contents page 1. Introduction 2 (a) Outline 3 2. Loss networks 4 (a) Erlang's formula 4 (b) A n e t work model 4 (c) Examples 6 3. Dynamic routing and stability 7 (a) Instability 8 (b) Dynamic Alternative Routing 10 (c) Extensions 12 4. Coalitions and global routing 14 (a) D o m i n a n t coalitions 15 (b) The core 16 (c) Transit payments 16 (d) Network evolution 18 5. Broadband traac and statistical sharing 19 (a) EEective bandwidths 19 (b) Multiplexing models 21 (c) Charging mechanisms 23 6. Conclusion 25 References 25
منابع مشابه
Object Modelling and Collison Avoidance Using Clifford Algebra
Abst ract In this paper the authors discuss a coordinate-free geometric approach using invariants to object modelling in computer vision. The new technique used to analyse the 3-dimensional transformations involved will be that of Cliiord algebra or geometric algebra. Object modelling and collision avoidance has been heavily discussed in the literature, however the Cliiord algebra based method ...
متن کاملBack Propagation in a Cli
Recent work has shown that in some cases the phase information of synaptic signal is important in the learning and representation capabilities of networks. Modelling such information with complex valued activation signals is possible, and indeed complex back-propagation algorithms have been derived 3]. Cliiord algebras give a way to generalise complex numbers to many dimensions. This paper pres...
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملEmerging Optical CDMA Techniques and Applications
In this paper we present an in-depth review on the trends and the directions taken by the researchers worldwide in Optical Code Division Multiple Access (OCDMA) systems. We highlight those trends and features that are believed to be essential to the successful introduction of various OCDMA techniques in communication systems and data networks in near future. In particular we begin by giving a c...
متن کاملComputation with Cliiord Valued Feed-forward Networks
Recent research has focused on feed-forward networks with complex weights and activation values such as GK92, Hir92b, Hir92a, Hir93]. This paper extends this formalism to feed-forward networks with weight and activation values taken from a Cliiord algebra (see also PB92, PB94b]). A Cliiord algebra is a multi-dimensional generalization of the complex numbers and the Quaternions. Essentially a Cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995